Timely, Reliable, and Cost-effective Transport Service using Dissemination Graphs

. We present preliminary work that demonstrates the feasibility of deploying an Internet transport service that can support applications with stringent timeliness and reliability requirements (e.g. 130ms round-trip latency across the US with 99.999% reliability). We describe an approach to building such a transport service based on overlay networks and dissemination graphs. In this approach, each packet is sent over a subgraph of the overlay topology (a dissemination graph) that is chosen based on reliability, latency, and cost requirements.